Local search for the maximum k-plex problem
نویسندگان
چکیده
منابع مشابه
Frequency-driven tabu search for the maximum s-plex problem
The maximum s-plex problem is an important model for social network analysis and other studies. In this study, we present an effective frequency-driven multineighborhood tabu search algorithm (FD-TS) to solve the problem on very large networks. The proposed FD-TS algorithm relies on two transformation operators (Add and Swap) to locate high-quality solutions, and a frequency-driven perturbation...
متن کاملCombinatorial algorithms for the maximum k-plex problem
The maximum clique problem provides a classic framework for detecting cohesive subgraphs. However, this approach can fail to detect much of the cohesive structure in a graph. To address this issue, Seidman and Foster introduced k-plexes as a degree-based relaxation of graph completeness. More recently, Balasundaram et al. formulated the maximum k-plex problem as an integer program and designed ...
متن کاملIterated k-Opt Local Search for the Maximum Clique Problem
This paper presents a simple iterated local search metaheuristic incorporating a k-opt local search (KLS), called Iterated KLS (IKLS for short), for solving the maximum clique problem (MCP). IKLS consists of three components: LocalSearch at which KLS is used, a Kick called LEC-Kick that escapes from local optima, and Restart that occasionally diversifies the search by moving to other points in ...
متن کاملModeling the maximum edge-weight k-plex partitioning problem
Given a sparse undirected graph G with weights on the edges, a k-plex partition of G is a partition of its set of nodes such that each component is a k-plex. A subset of nodes S is a k-plex if the degree of every node in the associated induced subgraph is at least |S| k. The maximum edge-weight k-plex partitioning (Max-EkPP) problem is to find a k-plex partition with maximum total weight, whe...
متن کامل(1, k)-Swap Local Search for Maximum Clique Problem
Given simple undirected graph G = (V, E), the Maximum Clique Problem(MCP) is that of finding a maximum-cardinality subset Q of V such that any two vertices in Q are adjacent. We present a modified local search algorithm for this problem. Our algorithm build some maximal solution and can determine in polynomial time if a maximal solution can be improved by replacing a single vertex with k, k ≥ 2...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Heuristics
سال: 2020
ISSN: 1381-1231,1572-9397
DOI: 10.1007/s10732-020-09459-5